Separating Complexity Classes Using Autoreducibility
نویسندگان
چکیده
منابع مشابه
Separating Complexity Classes Using Autoreducibility
A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from polynomial space by showing that all Turing-complete sets for certain levels of the exponential-time hierarchy are autoreducible but there exists some Turing-complete set for doubly exponential space that ...
متن کاملUsing Autoreducibility to Separate Complexity Classes
A language is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate exponential space from doubly exponential space by showing that all Turing-complete sets for exponential space are autoreducible but there exists some Turing-complete set for doubly exponential space that is not. We immediately also ge...
متن کاملSeparating the complexity classes NL and NP
There is no first order reduction from 3COLOR to REACH. Therefore NL 6= NP.
متن کاملSeparating the Notions of Self- and Autoreducibility
Recently Glaÿer et al. have shown that for many classes C including PSPACE and NP it holds that all of its nontrivial many-one complete languages are autoreducible. This immediately raises the question of whether all many-one complete languages are Turing self-reducible for such classes C. This paper considers a simpler version of this question whether all PSPACE-complete (NPcomplete) languages...
متن کاملSeparating NOF communication complexity classes RP and NP
In the number-on-forehead (NOF) model of communication complexity, k players are trying to evaluate a function F defined on kn bits. The input of F is partitioned into k pieces of n bits each, call them x1, . . . ,xk, and xi is placed, metaphorically, on the forehead of player i. Thus, each player sees (k − 1)n of the kn input bits. The players communicate by writing bits on a shared blackboard...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2000
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539798334736